Error Exponent for Multiple-Access Channels: Lower Bounds

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel

In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...

متن کامل

Error Exponent Region for Gaussian Multiple Access Channels and Gaussian Broadcast Channels

Error exponents for single-user additive white Gaussian noise (AWGN) channels provide bounds on the rate of exponential decay of the average probability of error as a function of the block length of the random codebooks. In this paper, we only consider Gallager-type lower bounds of error exponents [1, 2]. For simplicity, we use the term “error exponent” to mean the maximum of random coding expo...

متن کامل

Lower Bounds on the Quantum Capacity and Error Exponent of General Memoryless Channels

Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely positive linear map, where the dimension of the underlying Hilbert space is a prime number. On such a quantum channel, the highest fidelity of a quantum erro...

متن کامل

Lower bounds on the quantum capacity and highest error exponent of general memoryless channels

Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely positive linear map, where the dimension of the underlying Hilbert space is a prime number. On such a quantum channel, the highest fidelity of a quantum erro...

متن کامل

A New Upper Bound on the Average Error Exponent for Multiple-Access Channels

A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by Haroutunian. However, since explicitly imposes independence of the users’ input distributions (conditioned on the time-sharing auxiliary variable) results in a ti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2014

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2014.2331952